Matching with slot-specific priorities: Theory

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matching with Slot-Specific Priorities: Theory∗

We introduce a two-sided, many-to-one matching with contracts model in which agents with unit demand match to branches that may have multiple slots available to accept contracts. Each slot has its own linear priority order over contracts; a branch chooses contracts by filling its slots sequentially, according to an order of precedence. We demonstrate that in these matching markets with slot-spe...

متن کامل

Designing for Diversity: Matching with Slot-Specific Priorities∗

To encourage diversity, branches may vary contracts’ priorities across slots. The agents who match to branches, however, have preferences only over match partners and contractual terms. Ad hoc approaches to resolving agents’ indifferences across slots in the Chicago and Boston school choice programs have introduced biases, which can be corrected with more careful market design. Slot-specific pr...

متن کامل

Quadratic phase matching in slot waveguides.

We analyze phase matching with reference to frequency doubling in nanosized quadratic waveguides encompassing form birefringence and supporting cross-polarized fundamental and second-harmonic modes. In an AlGaAs rod with an air void, we show that phase-matched second-harmonic generation could be achieved in a wide spectral range employing state-of-the-art nanotechnology.

متن کامل

Strategy-proof tie-breaking in matching with priorities∗

A set of indivisible objects is allocated among agents with strict preferences. Each object has a weak priority ranking of the agents. A collection of priority rankings, a priority structure, is solvable if there is a strategy-proof mechanism that is constrained efficient, i.e. that always produces a stable matching that is not Pareto-dominated by another stable matching. We characterize all so...

متن کامل

Instrument dependency of Kubelka-Munk theory in computer color matching

Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Economics

سال: 2016

ISSN: 1933-6837

DOI: 10.3982/te1839